#include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
using ll = long long;
using T = int;
T rad(); // quick read
const int inf = 0x3f3f3f3f;
#define rf(i, n) for (int i = 1; i <= (n); ++i)
const int max_size = 5 + 100;
const int maxn = 5 + 1e5;

int n;
int a[maxn];

int main() {
    int Q = rad();
    while (Q--) {
        n = rad();
        ll alice = 0, bob = 0;
        rf(i, n) {
            int tmp = rad();
            if (tmp == 2) continue;
            if (tmp & 1)
                alice += tmp / 2 + 1;
            else
                bob += tmp / 2 - 1;
        }
        if (bob >= alice)
            puts("Bob");
        else
            puts("Alice");
    }
}

T rad() {
    T back = 0;
    int ch = 0, posi = 0;
    for (; ch < '0' || ch > '9'; ch = getchar())
        posi = ch ^ '-';
    for (; ch >= '0' && ch <= '9'; ch = getchar())
        back = (back << 1) + (back << 3) + (ch & 0xf);
    return posi ? back : -back;
}